Implementing interactive analysis of attack graphs using relational databases

نویسندگان

  • Lingyu Wang
  • Chao Yao
  • Anoop Singhal
  • Sushil Jajodia
چکیده

Lingyu Wang a,∗, Chao Yao b, Anoop Singhal c and Sushil Jajodia d a Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada E-mail: [email protected] b Center for Secure Information Systems, George Mason University, Fairfax, VA 22030-4444, USA E-mail: [email protected] c Computer Security Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, USA E-mail: [email protected] d Center for Secure Information Systems, George Mason University, Fairfax, VA 22030-4444, USA E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Analysis of Attack Graphs Using Relational Queries

Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed and implemented, causing a delay in the availability of analysis. Such a delay is usually unacceptable because the needs for analyzing attack graphs may change rapidly in defending against network intrusions. An administrator m...

متن کامل

A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

A Join Operator for Property Graphs

In the graph database literature the term “join” does not refer to an operator combining two graphs, but involves path traversal queries over a single graph. Current languages express binary joins through the combination of path traversal queries with graph creation operations. Such solution proves to be not efficient. In this paper we introduce a binary graph join operator and a corresponding ...

متن کامل

Text Schema Mining Using Graphs and Formal Concept Analysis

A Linearly Complex Model for Knowledge Representation . . . . . . . . . . . . . . . . . .20 Janos Sarbo and József Farkas Relation Graphs: A Structure for Representing Relations in Contextual Logic of Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 Silke Pollandt Information Transfer across Simple Concept Graphs . . . . . . . . . . . . . . . . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Computer Security

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2008